A Protocol to Detect and Kill Orphan Processes in Distributed Computer Systems
نویسنده
چکیده
The protocol presented here is to detect and kill orphan processes [1] in distributed computer systems effectively. That is it detects and kills the orphans when they are born. It does not waste any time to kill the orphans as the previous approaches do. All Remote procedure calls (RPC) [21][3][4] are recorded in the global log[5][6] which is associated with the monitor process[5][6] which is kept in the system to watch constantly the RPCs to find out the orphan computations. It is done by the monitor process which sends a token to those clients who participates in the RPCs and find out the active clients and abort [7] or crash processes [7]. The protocol is very much effective in the sense that the orphans are killed immediately after their birth. This protocol also handles the nested invocation [8] of RPCs. So, this protocol maintains data consistency [9] in the system and it avoids the wastage of valuable computer resources. All other approaches wait until the abort or crash process gets rebooted. Till the crash processes get rebooted, the orphans are active and make unwanted result which may lead to inconsistency [10] of data and moreover the wastages of valuable resources like CPU, memory and database etc.
منابع مشابه
An Improved Token-Based and Starvation Free Distributed Mutual Exclusion Algorithm
Distributed mutual exclusion is a fundamental problem of distributed systems that coordinates the access to critical shared resources. It concerns with how the various distributed processes access to the shared resources in a mutually exclusive manner. This paper presents fully distributed improved token based mutual exclusion algorithm for distributed system. In this algorithm, a process which...
متن کاملDisTriB: Distributed Trust Management Model Based on Gossip Learning and Bayesian Networks in Collaborative Computing Systems
The interactions among peers in Peer-to-Peer systems as a distributed collaborative system are based on asynchronous and unreliable communications. Trust is an essential and facilitating component in these interactions specially in such uncertain environments. Various attacks are possible due to large-scale nature and openness of these systems that affects the trust. Peers has not enough inform...
متن کاملExploring Language Learners’ Cognitive Processes in On-line ESP Courses via Think-aloud Protocol Analysis
The present study aims to investigate language learners’ cognitive processes in on-line ESP courses. Three modes of inquiry are used: think-aloud protocol analysis, screen capture analysis, and correlation analysis. The theoretical foundations for the evaluation of the cognitive aspect of Ferdowsi Univeristy of Mashhad E-learning System are drawn from cognitive load theory, cognitive apprentice...
متن کاملDisTriB: Distributed Trust Management Model Based on Gossip Learning and Bayesian Networks in Collaborative Computing Systems
The interactions among peers in Peer-to-Peer systems as a distributed collaborative system are based on asynchronous and unreliable communications. Trust is an essential and facilitating component in these interactions specially in such uncertain environments. Various attacks are possible due to large-scale nature and openness of these systems that affects the trust. Peers has not enough inform...
متن کاملOutlier Detection in Wireless Sensor Networks Using Distributed Principal Component Analysis
Detecting anomalies is an important challenge for intrusion detection and fault diagnosis in wireless sensor networks (WSNs). To address the problem of outlier detection in wireless sensor networks, in this paper we present a PCA-based centralized approach and a DPCA-based distributed energy-efficient approach for detecting outliers in sensed data in a WSN. The outliers in sensed data can be ca...
متن کامل